Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing

In this article, we present a detailed study of the reach distance-layer structure De Bruijn and Kautz digraphs, apply our analysis to performance evaluation deflection routing in networks. Concerning structure, provide explicit polynomial expressions, terms degree digraph, for cardinalities some relevant sets structure. Regarding application defection routing, as consequence description formulate probabilities interest type routing. digraphs are fundamental examples on alphabet iterated line digraphs. If topology network under consideration corresponds digraph type, can perform, principle, similar vertex layer description.